Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
121	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
122	Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com Add to Reading List Source URL: www.usna.edu Language: English - Date: 2015-05-19 21:11:47 Mathematics Convex optimization Mathematical optimization Computational problems Combinatorial optimization Computational complexity theory Combinatorics Linear programming Discrete mathematics Operations research Theoretical computer science Applied mathematics
123	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Geometric Hitting Set and Set Cover Problems with Half-Strips Apurva Mudgal ∗, ‡ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-20 06:19:10 Mathematical logic Computational complexity theory Gadget Clause Variable Theoretical computer science Mathematics Logic programming
124	Lower Bounds on Rate of Convergence of Cutting Plane Methods Xinhua Zhang Dept. of Computing Science University of Alberta Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-11-03 13:50:24 Operations research Mathematical optimization Support vector machines Convex optimization Statistical classification Sequential minimal optimization Linear programming Time complexity Dynamic programming Mathematics Algebra Theoretical computer science
125	CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Combinatorial optimization Matching Analysis of algorithms Operations research Dynamic programming Optimal control Hungarian algorithm Algorithm Time complexity Theoretical computer science Mathematics Applied mathematics
126	Jiang et al. BMC Bioinformatics 2015, 16(Suppl 5):S7 http://www.biomedcentral.comS5/S7 PROCEEDINGS Open Access Add to Reading List Source URL: www.biomedcentral.com Language: English Operations research Computational complexity theory Parameterized complexity Integer Linear programming XTR Abstract algebra Mathematics Algebra
127	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-24 09:52:12 Binary trees Analysis of algorithms Computational complexity theory Time complexity Dynamic programming Interval graph Tree decomposition Rope Interval tree Graph theory Theoretical computer science Mathematics
128	CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Computational complexity theory Travelling salesman problem Approximation algorithm Linear programming Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
129	An Experiment on the Cognitive Complexity of Code Michael Hansen () School of Informatics and Computing, 2719 E. 10th Street Bloomington, INUSA Robert L. Goldstone () Add to Reading List Source URL: www.indiana.edu Language: English - Date: 2014-02-11 17:08:34 Procedural programming languages Python Control flow C Regular expression ALGOL 68 Software bug Source lines of code Variable Software engineering Computing Computer programming
130	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory